Termination of Constructor Systems Using Semantic Uniication Termination of Constructor Systems Using Semantic Uniication Termination of Constructor Systems Using Semantic Uniication
نویسنده
چکیده
We present a new technique to prove termination of term rewrite systems, or more precise, constructor systems (CSs). In earlier work we introduced a transformation of well-moded logic programs into CSs, such that termination of the logic program follows from termination of the obtained CS. The technique to prove termination of CSs described in this paper is in particular suitable for, but not limited to, CSs that are obtained by this transformation of logic programs. Surprisingly, we need semantic uni cation in the technique. Thus, semantic uni cation can be used for giving termination proofs for logic programs. Parts of the technique can be automated very easily. Other parts can be automated for subclasses of CSs. An implementation is in progress that is able to prove termination of some CSs that are not simply terminating.
منابع مشابه
Termination of Logic Programs Using Semantic Unification
We introduce a transformation of well-moded logic programs into constructor systems, a subclass of term rewrite systems, such that left-termination of the logic program follows from termination of the derived constructor system. Thereafter, we present a new technique to prove termination of constructor systems. In the technique semantic uni-cation is used. Thus, surprisingly, semantic uniicatio...
متن کاملA technique for automatically proving termination of constructor systems
A technique is described to prove termination of constructor systems (CSs) automatically. The technique consists of three major steps. First, determine the dependency pairs of a constructor system. Second, nd an equational theory in which the constructor system is contained, and third, prove that no in nite chain w.r.t. the equational theory of these dependency pairs exists. The rst step is eas...
متن کاملOn the relation between size-based termination and semantic labelling
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard's reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the seman...
متن کاملOn the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard’s reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the seman...
متن کاملDecidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ground term rewriting systems. The decidability was shown by the fact that every non-terminating TRS in the class has a loop. In this paper we modify the proof of [9] to show that both innermost termination and μ-termi...
متن کامل